Optimization of web newspaper layout in real time
نویسندگان
چکیده
The web newspaper pagination problem consists in optimizing the layout of a set of articles extracted from several web newspapers and sending it to the user as the result of a previous query. This layout should be as similar as possible to that of real newspapers and should be adapted to the user's web browser con®guration in real time. Previous approaches to the problem took rather a long time or suered the constraint of all the articles having the same width. This paper presents an improved approach based on simulated annealing (SA) that solves the problem online, adapts itself to the client's computer con®guration and also supports articles with dierent widths, so that long articles can now be laid out in more than one column, producing a squarer shape. With this new feature, the layouts obtained look more like a real newspaper, where important or long articles occupy more than one column.
منابع مشابه
Web newspaper layout optimization using simulated annealing
The Web newspaper pagination problem consists of optimizing the layout of a set of articles extracted from several Web newspapers and sending it to the user as the result of a previous query. This layout should be organized in columns, as in real newspapers, and should be adapted to the client Web browser configuration in real time. This paper presents an approach to the problem based on simula...
متن کاملOptimizing Web Newspaper Layout Using Simulated Annealing
This paper presents a new approach to the pagination problem. This problem has traditionally been solved ooine for a variety of applications like the pagination of Yellow Pages or newspapers, but since these services have appeared in Internet, a new approach is needed to solve the problem in real time. This paper is concerned with the problem of paginating a selection of articles from web newsp...
متن کاملApplications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)
Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...
متن کاملDynamic Layout Optimization for Newspaper Web Sites using a Controlled Annealed Genetic Algorithm
................................................................................................................... iii Acknowledgements ............................................................................................... v Table of
متن کاملUsing Markov Chain to Analyze Production Lines Systems with Layout Constraints
There are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. These problems will cause overestimation of process time. Layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 36 شماره
صفحات -
تاریخ انتشار 2001